A Structured Construction of Optimal Measurement Matrix for Noiseless Compressed Sensing via Analog Polarization
نویسندگان
چکیده
Abstract—In this paper, we propose a method of structured construction of the optimal measurement matrix for noiseless compressed sensing (CS), which achieves the minimum number of measurements which only needs to be as large as the sparsity of the signal itself to be recovered to guarantee almost error-free recovery, for sufficiently large dimension. To arrive at the results, we employ a duality between noiseless CS and analog coding across sparse additive noisy channel (SANC). Extending Rényi’s Information Dimension to Mutual Information Dimension (MID), we show the operational meaning of MID to be the fundamental limit of asymptotically error-free analog transmission across SANC under linear analog encoding constraint. We prove that MID polarizes after analog polar transformation and obeys the same recursive relationship as BEC. We further prove that analog polar encoding can achieve the fundamental limit of achievable dimension rate with vanishing Pe across SANC. From the duality, a structured construction scheme is proposed for the linear measurement matrix which achieves the minimum measurement requirement for noiseless CS.
منابع مشابه
Deterministic Compressed Sensing Matrices from Additive Character Sequences
Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a K×N measurement matrix for compressed sensing is deterministically constructed via additive character sequences. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for N = K, and to present a sufficient condition on the ...
متن کاملA Block-Wise random sampling approach: Compressed sensing problem
The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...
متن کاملA new method on deterministic construction of the measurement matrix in compressed sensing
Construction on the measurement matrix A is a central problem in compressed sensing. Although using random matrices is proven optimal and successful in both theory and applications. A deterministic construction on the measurement matrix is still very important and interesting. In fact, it is still an open problem proposed by T. Tao. In this paper, we shall provide a new deterministic constructi...
متن کاملOptimal incorporation of sparsity information by weighted ℓ1 optimization
Compressed sensing of sparse sources can be improved by incorporating prior knowledge of the source. In this paper we demonstrate a method for optimal selection of weights in weighted l1 norm minimization for a noiseless reconstruction model, and show the improvements in compression that can be achieved.
متن کاملPerformance Limits for Jointly Sparse Signals via Graphical Models
The compressed sensing (CS) framework has been proposed for efficient acquisition of sparse and compressible signals through incoherent measurements. In our recent work, we introduced a new concept of joint sparsity of a signal ensemble. For several specific joint sparsity models, we demonstrated distributed CS schemes. This paper considers joint sparsity via graphical models that link the spar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012